Multiset antichains having minimal downsets
نویسندگان
چکیده
منابع مشابه
Structures Having O-minimal Open Core*
The open core of an expansion of a dense linear order is its reduct, in the sense of definability, generated by the collection of all of its open definable sets. In this paper, expansions of dense linear orders that have o-minimal open core are investigated, with emphasis on expansions of densely ordered groups. The first main result establishes conditions under which an expansion of a densely ...
متن کاملTrees having many minimal dominating sets
We disprove a conjecture by Skupień that every tree of order n has at most 2 minimal dominating sets. We construct a family of trees of both parities of the order for which the number of minimal dominating sets exceeds 1.4167. We also provide an algorithm for listing all minimal dominating sets of a tree in time O(1.4656). This implies that every tree has at most 1.4656 minimal dominating sets.
متن کاملEmbedded antichains in tournaments
The maximum antichain cardinality (MACC) of a tournament is the maximum number of incomparable subtournaments of T . We establish some properties of MACC. We describe all tournaments whose MACC is 1 or 2, show that MACC can grow exponentially with the size of the vertex set of a tournament, and present some questions for further investigation.
متن کاملOn canonical antichains
An antichain A of a well-founded quasi-order (E,≤) is canonical if for every finite subset A0 of A, all antichains of E\{x : x ≥ a for some a in A\A0} are finite. In this paper, we characterize those quasi-orders that have a canonical antichain. Guoli Ding, On canonical antichains, (July 20, 1994) 1
متن کاملWhen Simulation Meets Antichains
We describe a new and more efficient algorithm for checking universality and language inclusion on nondeterministic finite word automata (NFA) and tree automata (TA). To the best of our knowledge, the antichain-based approach proposed by De Wulf et al. was the most efficient one so far. Our idea is to exploit a simulation relation on the states of finite automata to accelerate the antichain-bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1988
ISSN: 0097-3165
DOI: 10.1016/0097-3165(88)90012-x